Containment of a pair of rotating objects within a container of minimal area or perimeter
نویسندگان
چکیده
Cutting and packing problems arise in many fields of applications and theory. When dealing with irregular objects, an important subproblem is the identification of the optimal clustering of two objects. Within this paper we consider the case, where two irregular one-connected objects whose frontier formed by circular and/or line segments and which can be free rotated, should be placed such that the enclosing rectangle or circle has minimal area, or alternatively, has minimal perimeter. We propose a solution strategy which is based on the concept of phi-functions and provide some examples. Moreover, for the sake of completeness, we give a comprehensive collection of basic phi-functions.
منابع مشابه
Optimal clustering of a pair of irregular objects
Cutting and packing problems arise in many fields of applications and theory. When dealing with irregular objects, an important subproblem is the identification of the optimal clustering of two objects. Within this paper we consider a container (rectangle, circle, convex polygon) of variable sizes and two irregular objects bounded by circular arcs and/or line segments, that can be continuously ...
متن کاملتعیین مناسب ترین شکل و اندازه پلات برای برآورد چند متغیر مرتعی در مراتع نیمه استپی
Proper judgement on rangeland state needs appropriate sampling plan and accurately estimation of plant characteristics. Sample shape and size are critical issues in vegetation measurement. Thus, decision on appropriate quadrate shape that enables us to determine several parameters accurately and timely would increase sampling efficiency. Several criterias including accuracy, perimeter/area rati...
متن کاملNonlinear stability of rotating two superposed magnetized fluids with the technique of the homotopy perturbation
In the present work, the Rayleigh-Taylor instability of two rotating superposed magnetized fluids within the presence of a vertical or a horizontal magnetic flux has been investigated. The nonlinear theory is applied, by solving the equation of motion and uses the acceptable nonlinear boundary conditions. However, the nonlinear characteristic equation within the elevation parameter is obtained....
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming Translational Polygon Containment and Minimal Enclosure Using Geometric Algorithms and Mathematical Programming
We present an algorithm for the two-dimensional translational containment problem: nd translations for k polygons (with up to m vertices each) which place them inside a polygonal container (with n vertices) without overlapping. The polygons and container may be nonconvex. The containment algorithm consists of new algorithms for restriction, evaluation, and subdivision of two-dimensional conngur...
متن کاملTranslational Polygon Containment and Minimal Enclosure Using Mathematical Programming
We present a new algorithm for the two-dimensional translational containment problem: nd translations for k polygons which place them inside a polygonal container without overlapping. Both the polygons and the container can be nonconvex. The algorithm is based on mathematical programming principles. We generalize our containment approach to solve minimal enclosure problems. We give algorithms t...
متن کامل